Completion Rules for Uncertainty Reasoning with the Description Logic ALC
نویسندگان
چکیده
Description Logics (DLs) are gaining more popularity as the foundation of ontology languages for the Semantic Web. On the other hand, uncertainty is a form of deficiency or imperfection commonly found in the real-world information/data. In recent years, there has been an increasing interest in extending the expressive power of DLs to support uncertainty, for which a number of frameworks have been proposed. In this paper, we introduce an extension of DL ( ) that unifies and/or generalizes a number of existing approaches for DLs with uncertainty. We first provide a classification of the components of existing frameworks for DLs with uncertainty in a generic way. Using this as a basis, we then discuss ways to extend these components with uncertainty, which includes the description language, the knowledge base, and the reasoning services. Detailed explanations and examples are included to describe the proposed completion rules.
منابع مشابه
A Diagrammatic Reasoning System for ALC
Description logics (DLs) are a well-known family of knowledge representation (KR) languages. The notation of DLs has the style of a variable-free first order predicate logic. In this paper a diagrammatic representation of the DL ALC– based on Peirce’s existential graphs – is presented and a set of transformation rules on these graphs provided. As the transformation rules modify the diagrammatic...
متن کاملALC + T: Reasoning About Typicality in Description Logics
We extend the Description Logic ALC with a “typicality” operator T that allows us to reason about the prototypical properties and inheritance with exceptions. The resulting logic is called ALC + T. The typicality operator is intended to select the “most normal” or “most typical” instances of a concept. In our framework, knowledge bases may then contain, in addition to ordinary ABoxes and TBoxes...
متن کاملExtension of Description Logics for Reasoning About Typicality
We extend the Description Logic ALC with a “typicality” operator T that allows us to reason about the prototypical properties and inheritance with exceptions. The resulting logic is called ALC + T. The typicality operator is intended to select the “most normal” or “most typical” instances of a concept. In our framework, knowledge bases may then contain, in addition to ordinary ABoxes and TBoxes...
متن کاملOn Extending Description Logics for Reasoning About Typicality: a First Step
We extend the Description Logic ALC with a “typicality” operator T that allows us to reason about the prototypical properties and inheritance with exceptions. The resulting logic is called ALC + T. The typicality operator is intended to select the “most normal” or “most typical” instances of a concept. In our framework, knowledge bases may then contain, in addition to ordinary ABoxes and TBoxes...
متن کاملA Peirce Style Calculus for ALC
Description logics (DLs) are a well-understood family of knowledge representation (KR) languages. The notation of DLs has the flavour of a variable-free first order predicate logic. In this paper, a diagrammatic representation of the DLALC, based on Peirce’s existential graphs, is presented, and a set of transformation rules on these graphs is provided. It is proven that these rules form a soun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006